Dealing with Incompleteness and Vagueness in Inductive Logic Programming
نویسندگان
چکیده
Incompleteness and vagueness are inherent properties of knowledge in several real world domains and are particularly pervading in those domains where entities could be better described in natural language. In order to deal with incomplete and vague structured knowledge, several fuzzy extensions of Description Logics (DLs) have been proposed in the literature. In this paper, we address the issues raised by incomplete and vague knowledge in Inductive Logic Programming (ILP). We present a novel ILP method for inducing fuzzy DL inclusion axioms from crisp DL knowledge bases and discuss the results obtained in comparison with related works.
منابع مشابه
Hybrid Abductive Inductive Learning: A Generalisation of Progol
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success, it is known that Bottom Generalisation, and therefore Progol5, are restricted to finding hypotheses that lie within the semantics of Plotkin’s relative subsumption. This paper exposes a previously unknown incompleten...
متن کاملHybrid abductive inductive learning
This thesis introduces a new Machine Learning technique called Hybrid Abductive Inductive Learning (HAIL) that integrates Abductive Logic Programming (ALP) and Inductive Logic Programming (ILP) in order to automate the learning of first-order theories from examples and prior knowledge. A semantics is proposed called Kernel Set Subsumption (KSS) that generalises the well-known inference method o...
متن کاملLogic-based Rule Learning for the Web of Data
This tutorial introduces to Inductive Logic Programming (ILP), being it a major logic-based approach to rule learning, and surveys extensions of ILP that turn out to be suitable for applications to the emerging vision of the Semantic Web as a Web of Data. 1 Outline of the tutorial Rules are widely used in Knowledge Engineering (KE) and Knowledge Representation (KR) as a powerful way of modeling...
متن کاملco-LP: Back to the Roots
Recently, several papers dealing with co-inductive logic programming have been proposed, dealing with pure Prolog and constraint logic programming, with and without negation. In this paper we revisit and use, as much as possible, some fundamental results developed in the Eighties to analyze the foundations, and to clarify the possibilities but also the intrinsic theoretical limits of this progr...
متن کاملTheory of multiple-valued defeasible argumentation and its applications
This paper provides a new departure from the traditional twovalued argumentation frameworks. We address ourselves to formalize an expressive logic of argumentation, called a Logic of Multiple-valued Argumentation (LMA), on top of the very expressive knowledge representation language, called Extended Annotated Logic Programming (EALP), and examine its logical properties in various ways. EALP all...
متن کامل